Lower bound for the number of real roots of a random algebraic polynomial
نویسندگان
چکیده
منابع مشابه
Research Article On the Lower Bound for the Number of Real Roots of a Random Algebraic Equation
where the aν(ω), ν= 0,1, . . . ,n, are random variables defined on a fixed probability space (Ω, ,Pr) assuming real values only. During the past 40–50 years, the majority of published researches on random algebraic polynomials has concerned the estimation of Nn(R,ω). Works by Littlewood and Offord [1], Samal [2], Evans [3], and Samal and Mishra [4–6] in the main concerned cases in which the ran...
متن کاملOn the Expected Number of Real Roots of a System of Random Polynomial Equations
We unify and generalize several known results about systems of random polynomials. We first classify all orthogonally invariant normal measures for spaces of polynomial mappings. For each such measure we calculate the expected number of real zeros. The results for invariant measures extend to underdetermined systems, giving the expected volume for orthogonally invariant random real projective v...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملOn the Number of Real Roots of a Random Algebraic Equation
1 . SOME time ago Littlewood and Offordt gave estimates of the number of real roots that an equation of degree n selected at random might be expected to have for various classes of equations in which the coefficients were selected on some probability basis . They found that, when each coefficient was treated on the same basis, the results were practically the same in all cases considered and ag...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1983
ISSN: 0263-6115
DOI: 10.1017/s1446788700024745